Compressive Sensing for Cluster Structured Sparse Signals: Variational Bayes Approach
نویسندگان
چکیده
Compressive Sensing (CS) provides a new paradigm of sub-Nyquist sampling which can be considered as an alternative to Nyquist sampling theorem. In particular, providing that signals are with sparse representations in some known space (or domain), information can be perfectly preserved even with small amount of measurements captured by random projections. Besides sparsity prior of signals, the inherent structure property underline some specific signals is often exploited to enhance the reconstruction accuracy and promote the ability of recovery. In this paper, we are aiming to take into account the cluster structure property of sparse signals, of which the nonzero coefficients appear in clustered blocks. By modeling simultaneously both sparsity and cluster prior within a hierarchical statistical Bayesian framework, a nonparametric algorithm can be obtained through variational Bayes approach to recover original sparse signals. The proposed algorithm could be slightly considered as a generalization of Bayesian CS, but with a consideration on cluster property. Consequently, the performance of the proposed algorithm is at least as good as Bayesian CS, which is verified by the experimental results. Index Terms Compressive Sensing, Cluster Structure, Variational Bayes.
منابع مشابه
Bayesian compressive sensing for cluster structured sparse signals
In traditional framework of Compressive Sensing (CS), only sparse prior on the property of signals in time or frequency domain is adopted to guarantee the exact inverse recovery. Other than sparse prior, structures on the sparse pattern of the signal have also been used as an additional prior, called modelbased compressive sensing, such as clustered structure and tree structure on wavelet coeff...
متن کاملBayesian Multi-Task Compressive Sensing with Dirichlet Process Priors
Compressive sensing (CS) is an emerging field that, under appropriate conditions, can significantly reduce the number of measurements required for a given signal. Specifically, if the m-dimensional signal u is sparse in an orthonormal basis represented by the m × m matrix Ψ, then one may infer u based on n m projection measurements. If u = Ψθ, where θ are the sparse coefficients in basis Ψ, the...
متن کاملEmpirical-Bayes Approaches to Recovery of Structured Sparse Signals via Approximate Message Passing
In recent years, there have been massive increases in both the dimensionality andsample sizes of data due to ever-increasing consumer demand coupled with relativelyinexpensive sensing technologies. These high-dimensional datasets bring challengessuch as complexity, along with numerous opportunities. Though many signals ofinterest live in a high-dimensional ambient space, they of...
متن کاملModel-based compressive sensing with Earth Mover’s Distance constraints
In compressive sensing, we want to recover a k-sparse signal x ∈ R from linear measurements of the form y = Φx, where Φ ∈ Rm×n describes the measurement process. Standard results in compressive sensing show that it is possible to exactly recover the signal x from only m = O(k log n k ) measurements for certain types of matrices. Model-based compressive sensing reduces the number of measurements...
متن کاملCompressive Parameter Estimation with Earth Mover’s Distance via K-Median Clustering
In recent years, sparsity and compressive sensing have attracted significant attention in parameter estimation tasks, including frequency estimation, delay estimation, and localization. Parametric dictionaries collect observations for a sampling of the parameter space and can yield sparse representations for the signals of interest when the sampling is su ciently dense. While this dense samplin...
متن کامل